Deadline-Based Scheduling Algorithm for Divisible-Load in Grid Computing

The divisible load model is motivated by divisible load theory, where both communication and computation can be arbitrarily divisible into as many independent partitions as required and facilitates a good approximation for many real-world application systems such as those arising in large physics experiments. Scheduling an application with divisible load in data grid is significantly important because of its dynamic nature. Therefore, this paper presents DBSA scheduling model to provide deterministic QoS to arbitrarily divisible applications executing in a grid environment. In addition, the simulation uses a more realistic platform and provides an analysis of the algorithm for homogeneous platforms and presents the comparison results with multi-round algorithm known as UMR (Uniform Multi Round) based on two factors cost and makespan. The simulation result shows that the proposed DBSA minimizes the makespan, cost and balance the load more efficiently. KeywordsDivisible Load Theory (DLT), Quality of Service (QoS), UMR (Uniform Multi Round).